Randomized Projection Methods for Corrupted Linear Systems

نویسندگان

  • Jamie Haddock
  • Deanna Needell
چکیده

In applications like medical imaging, error correction, and sensor networks, one needs to solve large-scale linear systems that may be corrupted by a small number of, but arbitrarily large, corruptions. We consider solving such large-scale systems of linear equations $A\mathbf{x}=\mathbf{b}$ that are inconsistent due to corruptions in the measurement vector $\mathbf{b}$. With this as our motivating example, we develop an approach for this setting that allows detection of the corrupted entries and thus convergence to the"true"solution of the original system. We provide analytical justification for our approaches as well as experimental evidence on real and synthetic systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kalman Filtering for Linear Time-Delayed Continuous-Time Systems with Stochastic Multiplicative Noises 355 Kalman Filtering for Linear Time-Delayed Continuous-Time Systems with Stochastic Multiplicative Noises

Abstract: The paper deals with the Kalman stochastic filtering problem for linear continuoustime systems with both instantaneous and time-delayed measurements. Different from the standard linear system, the system state is corrupted by multiplicative white noise, and the instantaneous measurement and the delayed measurement are also corrupted by multiplicative white noise. A new approach to the...

متن کامل

Two-subspace Projection Method for Coherent Overdetermined Systems

Abstract. We present a Projection onto Convex Sets (POCS) type algorithm for solving systems of linear equations. POCS methods have found many applications ranging from computer tomography to digital signal and image processing. The Kaczmarz method is one of the most popular solvers for overdetermined systems of linear equations due to its speed and simplicity. Here we introduce and analyze an ...

متن کامل

Randomized Methods for Linear Constraints: Convergence Rates and Conditioning

We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of Strohmer and Vershynin for systems of linear equations, we show that, under appropriate probability distributions, the linear rates of convergence (in expectatio...

متن کامل

Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme

Sparsified Randomization Monte Carlo (SRMC) algorithms for solving systems of linear algebraic equations introduced in our previous paper [34] are discussed here in a broader context. In particular, I present new randomized solvers for large systems of linear equations, randomized singular value (SVD) decomposition for large matrices and their use for solving inverse problems, and stochastic si...

متن کامل

Randomized Block Kaczmarz Method with Projection for Solving Least Squares

The Kaczmarz method is an iterative method for solving overcomplete linear systems of equations Ax = b. The randomized version of the Kaczmarz method put forth by Strohmer and Vershynin iteratively projects onto a randomly chosen solution space given by a single row of the matrix A and converges exponentially in expectation to the solution of a consistent system. In this paper we analyze two bl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018